A problem concerning infinite graphs
نویسندگان
چکیده
منابع مشابه
On a problem of R. Halin concerning infinite graphs II
For every countable, connected graph A containing no one-way infinite path the following is shown: Let G be an arbitrary graph which contains for every positive integer n a system of n disjoint graphs each isomorphic to a subdivision of A. Then G also contains infinitely many disjoint subgraphs each isomorphic to a subdivision of A. In addition, corrections of errors are given that occur unfort...
متن کاملThe Reachability Problem over Infinite Graphs
We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinitestate systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems. 1 Historical Introduction In a rather unknown paper of 1910, titled Die Lösung eines S...
متن کاملA Reflexivity Problem concerning The
Let X be a compact Hausdorff space and let H be a separable Hilbert space. We prove that the group of all order automorphisms of the C∗-algebra C(X)⊗ B(H) is algebraically reflexive.
متن کاملOn a Conjecture concerning Vertex-transitive Graphs
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture, which would imply the Lovasz conjecture and give an interesting insight on the symmetry of vertex-transitive graphs, if true. Though it could become an approach ...
متن کاملOn a Conjecture Concerning Helly Circle Graphs
We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and ineq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1976
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90066-2